A Performance Analysis of Fast Gabor Transform Methods
نویسندگان
چکیده
complex exponentials. Bastiaans [2] dubbed this family of functions the Gabor elementary functions (GEF). He also Computation of the finite discrete Gabor transform can be accomplished in a variety of ways. Three representative methgeneralized the notion of Gabor’s expansion to include ods (matrix inversion, Zak transform, and relaxation network) non-Gaussian windows. were evaluated in terms of execution speed, accuracy, and The Gabor transform has several features which make stability. The relaxation network was the slowest method tested. it attractive for image representation. First, the nonstationIts strength lies in the fact that it makes no explicit assumptions ary nature of many natural signals [3, 4] mean that local, about the basis functions; in practice it was found that convernot global, frequency information is desirable; the Gabor gence did depend on basis choice. The matrix method requires transform provides this. The GEF also enjoy the property a separable Gabor basis (i.e., one that can be generated by of minimal joint uncertainty. Each GEF is thus maximally taking a Cartesian product of one-dimensional functions), but concentrated in space and spatial frequency; this property is faster than the relaxation network by several orders of magnicarries over to higher dimensional GEF also [5, 6]. It has tude. It proved to be a stable and highly accurate algorithm. The Zak–Gabor algorithm requires that all of the Gabor basis also been shown empirically [7] that the entropy of the functions have exactly the same envelope and gives no freedom Gabor transform of an image is much lower than the enin choosing the modulating function. Its execution, however, tropy of the pixel representation of the image. In fact, is very stable, accurate, and by far the most rapid of the three recent work indicates that Gabor expansions can provide methods tested. 1997 Academic Press better signal compression that can the DCT for very low bit rates [8]. The Gabor expanison is therefore recognized as a potential image compression tool [9–11].
منابع مشابه
Texture Classification of Diffused Liver Diseases Using Wavelet Transforms
Introduction: A major problem facing the patients with chronic liver diseases is the diagnostic procedure. The conventional diagnostic method depends mainly on needle biopsy which is an invasive method. There are some approaches to develop a reliable noninvasive method of evaluating histological changes in sonograms. The main characteristic used to distinguish between the normal...
متن کاملAn Enhanced Approach for Iris Recognition Using Fusion of FWT with Gabor Wavelet Transform and Daugman Encoding
This paper discusses iris recognition, which is accepted as one of the best biometric methods for identifying an individual. A comparative analysis is done for eight algorithms, namely DCWT, FWT, SWT, CWT, DB, Complex dual tree, Haar wavelet and Wavelet packet for extracting the feature from iris image. Extracting the iris features of the image is still inconceivable as the existing algorithms ...
متن کاملتشخیص چهره با استفاده از PCA و فیلتر گابور
Methods for face recognition which are based on face structure are among techniques without supervision and produce unfavorable results in the presence of linear changes in images. PCA is a linear transform and a powerful tool for data analysis but does not produce good results for face recognition when there are non-linear changes resulting from changes in position, intensity and gesture in th...
متن کاملFast Computation of the Gabor Wavelet Transform
The Gabor filter is a valuable tool in computer vision, however, its high computational load precludes its use in many applications. This paper presents a novel method for approximating Gabor wavelets with a function that can be convolved more efficiently in the spatial domain. The method extends the well known separable nature of the Gabor filter, and demonstrates a means for reducing the comp...
متن کاملComparison of Gabor-Wigner Transform and SPWVD as tools of harmonic computation
The measurement algorithms applied in power quality measurement systems are based on Fast Fourier Transformation. That one-dimension frequency analysis is sufficient in many cases. However, to illustrate the character of the signal in a more comprehensive manner, it is crucial to represent the investigated signal on time-frequency plane. There are a lot of time-frequency representations (TFR) f...
متن کاملSpectro-temporal analysis of speech using 2-d Gabor filters
We present a 2-D spectro-temporal Gabor filterbank based on the 2-D Fast Fourier Transform, and show how it may be used to analyze localized patches of a spectrogram. We argue that the 2-D Gabor filterbank has the capacity to decompose a patch into its underlying dominant spectro-temporal components, and we illustrate the response of our filterbank to different speech phenomena such as harmonic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CVGIP: Graphical Model and Image Processing
دوره 59 شماره
صفحات -
تاریخ انتشار 1997